A Fuzzy Genetic Algorithm for Scheduling of Handling / Storage Equipment in Automated Container Terminals
نویسنده
چکیده
Integrated scheduling of handling/storage equipment in container terminals is an NP-hard problem which has been studied during past two decades consciously. Genetic algorithms (GAs) have been applied for this optimization problem in many researches. However, the GA is vulnerable to trap in a local optima (results in premature convergence). In this paper a fuzzy logic controller (FLC) is designed to improve the performance of a GA in optimization of integrated scheduling of handling/storage equipment in automated container terminals. The FLC controls crossover and mutation rates of the GA during its generations, which are the main control parameters of the GA to avoid the premature convergence. The numerical results for the small size test cases solved by using the proposed fuzzy genetic algorithm show that solutions found by this algorithm are 2.5% better than the solutions found by the GA. Studies are continuing for better performance of the proposed FGA.
منابع مشابه
An Integrated Scheduling Problem of Container Handling Equipment in the Loading Operation at Automated Container Terminals
In automated container terminals, containers are transported between ships and storage yard by differen types of vehicles, for example, guided vehicle (AGV, yard crane (YC) and quay crane (QC). To improve the productivity of the automated container terminals, it is important to harmoniously synchronize operations of different types of container handling equipment. This paper examines the schedu...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملScheduling Single-Load and Multi-Load AGVs in Container Terminals
In this paper, three solutions for scheduling problem of the Single-Load and Multi-Load Automated Guided Vehicles (AGVs) in Container Terminals are proposed. The problem is formulated as Constraint Satisfaction and Optimization. When capacity of the vehicles is one container, the problem is a minimum cost flow model. This model is solved by the highest performance Algorithm, i.e. Network Simple...
متن کاملScheduling in Container Terminals using Network Simplex Algorithm
In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional si...
متن کاملYard crane scheduling in port container terminals using genetic algorithm
Yard crane is an important resource in container terminals. Efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. This paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is NPHARD in nature. In other words, one of the most important constraints in...
متن کامل